1 PASS: A Parallel Activity Search System Andrea Pugliese, V.S. Subrahmanian, Christopher Thomas, and Cristian Molinaro Abstract—Given a set A of activities expressed via temporal stochastic automata, and a set O of o

Source URL: www.cs.umd.edu

• Network theory
• Edsger W. Dijkstra
• Shortest path problem
• Dynamic programming

On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs Richard Schmied∗ Claus Viehmann†

Source URL: theory.cs.uni-bonn.de

Cubical Type Theory Free bounded distributive lattice The free distributive lattice on a set J can be described as the set of finite antichains in the poset of finite subsets of J, for the order L 6 M if, and only if, f

Source URL: www.cse.chalmers.se

Rudolf von Bitter Rucker was born March 22, 1946 in Louisville KY. He attended Swarthmore, earning a BA in mathematics in 1967, and did graduate work at Rutgers, studying mathematical logic and set theory, and getting a

Source URL: www.rudyrucker.com

MATH 592 SPRING 2010 TOPICS IN ERGODIC THEORY AND PROBABILITY PROBLEM SET 1 1. Let f : Fnp → C, let V be a subspace of Fnp , and write g = f · 1V . Show that gb(t) = Es∈V ⊥ fb(s + t)

Source URL: www.juliawolf.org

“Refuting” Cantor Jaime Gaspar∗ 28 January 2014 The German mathematician Georg Cantor used his famous diagonal argument to prove his celebrated theorem showing that there is no bijection between the set of all natu

Source URL: jg.sdf.org

• Mathematics
• Mathematical logic
• Set theory
• Georg Cantor
• Bijection
• Rocquencourt
• Ordinal number
• Cardinal numbers

Rough Sets: Theory and Applications Workshop at the Joint Rough Set Symposium July 9th, 2014 Granada, Spain

Source URL: www.cwi.ugent.be

First-Order Logic vs. Fixed-Point Logic in Finite Set Theory Albert Atserias Computer Science Department University of California Santa Cruz, CA 95064

Source URL: www.cs.upc.edu

Set theory and operator algebras (the final thirty minutes of the talk) Ilijas Farah York University Carnegie Mellon, February 9, 2008

Source URL: www.math.cmu.edu

Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search Scott Beamer EECS Department University of California Berkeley, California

Source URL: crd.lbl.gov

• Graph theory
• Graph connectivity
• Search algorithms
• Breadth-first search
• Graph traversal
• Spanning tree
• Strongly connected component
• Tree
• Ear decomposition
• Connected component
• Graph coloring
• Maximal independent set